Lattice modules having small cofinite irreducibles
نویسندگان
چکیده
منابع مشابه
A Generalization of M-Small Modules
In this paper we introduce a generalization of M-small modules and discuss about the torsion theory cogenerated by this kind of modules in category . We will use the structure of the radical of a module in and get some suitable results about this class of modules. Also the relation between injective hull in and this kind of modules will be investigated in this article. For a module we show...
متن کاملSecond and Secondary Lattice Modules
Let M be a lattice module over the multiplicative lattice L. A nonzero L-lattice module M is called second if for each a ∈ L, a1M = 1M or a1M = 0M . A nonzero L-lattice module M is called secondary if for each a ∈ L, a1M = 1M or a(n)1M = 0 M for some n > 0. Our objective is to investigative properties of second and secondary lattice modules.
متن کاملRoots and Irreducibles
This handout discusses relationships between roots of irreducible polynomials and field extensions. Throughout, the letters K, L, and F are fields and Fp = Z/(p) is the field of p elements. When f(X) ∈ K[X], we will say f(X) is a polynomial “over” K. Sections 2 and 3 describe some general features of roots of polynomials. In the later sections we look at roots to polynomials over the finite fie...
متن کاملThe small intersection graph relative to multiplication modules
Let $R$ be a commutative ring and let $M$ be an $R$-module. We define the small intersection graph $G(M)$ of $M$ with all non-small proper submodules of $M$ as vertices and two distinct vertices $N, K$ are adjacent if and only if $Ncap K$ is a non-small submodule of $M$. In this article, we investigate the interplay between the graph-theoretic properties of $G(M)$ and algebraic properties of $M...
متن کاملReciprocal Polynomials Having Small Measure
The measure of a monic polynomial is the product of the absolute value of the roots which lie outside and on the unit circle. We describe an algorithm, based on the root-squaring method of Graeffe, for finding all polynomials with integer coefficients whose measures and degrees are smaller than some previously given bounds. Using the algorithm, we find all such polynomials of degree at most 16 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2001
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171201004604